Energy flow polynomials: a complete linear basis for jet substructure
نویسندگان
چکیده
منابع مشابه
Precision jet substructure from boosted event shapes.
Jet substructure has emerged as a critical tool for LHC searches, but studies so far have relied heavily on shower Monte Carlo simulations, which formally approximate QCD at the leading-log level. We demonstrate that systematic higher-order QCD computations of jet substructure can be carried out by boosting global event shapes by a large momentum Q and accounting for effects due to finite jet s...
متن کاملNondeterministic approach to tree-based jet substructure.
Jet substructure is typically studied using clustering algorithms, such as k(T), which arrange the jets' constituents into trees. Instead of considering a single tree per jet, we propose that multiple trees should be considered, weighted by an appropriate metric. Then each jet in each event produces a distribution for an observable, rather than a single value. Advantages of this approach includ...
متن کاملA fractional type of the Chebyshev polynomials for approximation of solution of linear fractional differential equations
In this paper we introduce a type of fractional-order polynomials based on the classical Chebyshev polynomials of the second kind (FCSs). Also we construct the operational matrix of fractional derivative of order $ gamma $ in the Caputo for FCSs and show that this matrix with the Tau method are utilized to reduce the solution of some fractional-order differential equations.
متن کاملA New Basis for Discrete Analytic Polynomials
A new basis {irk(z)}t.o for discrete analytic polynomials is presented for which the series 2k-o ak7Tk(z) converges absolutely to a discrete analytic function in the upper right quarter lattice whenever lim | ak \" k = 0. Introduction Let Z be the group of integers and consider functions / : Z X Z ^ C such that (1.1) f(x, y) + if(x + 1, y) / (* + 1, y + 1) if(x, y + 1) = 0 for every (x, y ) £ Z...
متن کاملHomomorphism Polynomials Complete for VP
The VP versus VNP question, introduced by Valiant, is probably the most important open question in algebraic complexity theory. Thanks to completeness results, a variant of this question, VBP versus VNP, can be succinctly restated as asking whether the permanent of a generic matrix can be written as a determinant of a matrix of polynomially bounded size. Strikingly, this restatement does not me...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of High Energy Physics
سال: 2018
ISSN: 1029-8479
DOI: 10.1007/jhep04(2018)013